On induced congruences
نویسندگان
چکیده
In this note we present a proof of a theorem to be found in Ehrig and Mahr [3). The theorem states that a relation constructed from a given function is a congruence relation if that function is a homomorphism: we go on to generalise this result to the relational homomorphisms treated by the first author in [1]. Specifically, we prove that. a congruence relation can be constructed from a relational homomorphism. Our construction generalises that of Ehrig and Mahr. The significance of this note lies both in the economy of our calculations and in the novel use we make of weakest prespecifications. We have been unable to extend the theorem to an equivalence: we offer the remaining half of the equivalence as a challenge to the reader. We consider a type T defined according to the paradigm T = p(r : F). where F is a relator (such types are special cases of Hagino types’. details of which may be found in Hagino 14]). For the purposes of this note, the important properties of a relator F are the following.
منابع مشابه
Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملFuzzy order congruences on fuzzy posets
Fuzzy order congruences play an important role in studying the categoricalproperties of fuzzy posets. In this paper, the correspondence between the fuzzyorder congruences and the fuzzy order-preserving maps is discussed. We focus onthe characterization of fuzzy order congruences on the fuzzy poset in terms ofthe fuzzy preorders containing the fuzzy partial order. At last, fuzzy completecongruen...
متن کاملTHE LATTICE OF CONGRUENCES ON A TERNARY SEMIGROUP
In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...
متن کاملInfix Congruences on a Free Monoid
A congruence p on a free monoid X* is said to be infix if each class C of p satisfies u e C and xuy € C imply xy = 1 . The main purpose of this paper is a characterization of commutative maximal infix congruences. These turn out to be congruences induced by homomorphisms t from X* to N° , the monoid of nonnegative integers under addition, with T"1(0) = 1.
متن کاملSOME INTUITIONISTIC FUZZY CONGRUENCES
First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...
متن کاملPermutability of Tolerances with Factor and Decomposing Congruences
A variety V has tolerances permutable with factor congruences if for any A1, A2 of V and every tolerance T on A1 × A2 we have T ◦ Π1 = Π1 ◦ T and T ◦ Π2 = Π2 ◦ T , where Π1,Π2 are factor congruences. If B is a subalgebra of A1×A2, the congruences Θi = Πi∩B are called decomposing congruences. V has tolerances permutable with decomposing congruences if T ◦ Θi = Θi ◦ T (i = 1, 2) for each A1, A2 ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of the EATCS
دوره 40 شماره
صفحات -
تاریخ انتشار 1990